Abstract Regular Tree Model Checking with Nondeterministic Automata
نویسنده
چکیده
Regular Tree Model Checking with Nondeterministic Automata
منابع مشابه
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
We propose new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata. We have implemented these algorithms in a prototype tool and we present experiments which show that the algorithms provide a significant improvement over the traditional determinisationbased approaches. Furthermore, we use the proposed antichain-based inclusion checking algorithm...
متن کاملPushdown Specifications
Traditionally, model checking is applied to finite-state systems and regular specifications. While researchers have successfully extended the applicability of model checking to infinite-state systems, almost all existing work still consider regular specification formalisms. There are, however, many interesting non-regular properties one would like to model check. In this paper we study model ch...
متن کاملSimulations and Antichains for Efficient Handling of Finite Automata
This thesis is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns namely techniques for size reduction and language inclusion testing, which are two problems that are crucial for many applications of tree automata. For size reduction of tree automata, we adapt the simulation quotient technique that is well...
متن کاملCut - offs and Automata in Formal Verification of Infinite - State Systems Habilitation
In this habilitation thesis, we discuss two complementary approaches to formal verification of infinite-state systems—namely, the use cut-offs and automata-based symbolic model checking (especially the so-called regular model checking). The thesis is based on extended versions of multiple conference and journal papers joint into a unified framework and accompanied with a significantly extended ...
متن کاملGlobal Model-Checking of Infinite-State Systems
We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Chec...
متن کامل